A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems
نویسندگان
چکیده
منابع مشابه
A discrete firefly meta-heuristic with local search for makespan minimization in permutation flow shop scheduling problems
Article history: Received 23 January 2010 Received in revised form 23 April 2010 Accepted 26 April 2010 Available online 26 April 2010 During the past two decades, there have been increasing interests on permutation flow shop with different types of objective functions such as minimizing the makespan, the weighted mean flow-time etc. The permutation flow shop is formulated as a mixed integer pr...
متن کاملA tabu search approach for makespan minimization in a permutation flow shop scheduling problems
On a permutation flowshop scheduling problem(PFSP), n jobs are arranged on m machines in a series with the same routing for each machine. The objective of scheduling is to find a sequence of jobs under minimization of makespan. From many researches, the upperbound values from the benchmark problems have been shown. In this paper, a tabu search approach for improving the upperbound values from t...
متن کاملAn Exchange Local Search Heuristic based Scheme for Permutation Flow Shop Problems
In manufacturing organization, one of the mechanisms to minimize makespan (the total completion time) requires machines and operations to be in accordance with a specific flow sequence, i.e., each production run has the same processing order. Determining the specific flow sequence to minimize the makespan is the well-known scheduling problem named permutation flow-shop problem (PFSP) which has ...
متن کاملEvolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop
This paper deals with the Permutation Flow Shop scheduling problem with the objective of minimizing total flow time, and therefore reducing in-process inventory. A new hybrid metaheuristic Genetic Algorithm Cluster Search is proposed for the scheduling problem solution. The performance of the proposed method is evaluated and results are compared with the best reported in the literature. Experim...
متن کاملFlow-shop Problems: A Heuristic Search Algorithm
This article presents an intelligent heuristic search algorithm (IHSA*) for solving flow-shop problems with two or three machines and an arbitrary number of jobs. Following its initial development the algorithm has been modified in two different ways in order to reduce backtracking and to improve its performance. The first modification concerns the choice of the best heuristic function to use, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Industrial Engineering Computations
سال: 2010
ISSN: 1923-2926,1923-2934
DOI: 10.5267/j.ijiec.2010.01.001